Incremental window-based protein sequence alignment algorithms
نویسندگان
چکیده
منابع مشابه
Incremental window-based protein sequence alignment algorithms
MOTIVATION Protein sequence alignment plays a critical role in computational biology as it is an integral part in many analysis tasks designed to solve problems in comparative genomics, structure and function prediction, and homology modeling. METHODS We have developed novel sequence alignment algorithms that compute the alignment between a pair of sequences based on short fixed- or variable-...
متن کاملIncremental Multiple Sequence Alignment
This work proposes a new approach to the alignment of multiple sequences. We take profit from some results on Grammatical Inference that allow us to build iteratively an abstract machine that considers in each inference step an increasing amount of sequences. The obtained machine compile the common features of the sequences, and can be used to align these sequences. This method improves the tim...
متن کاملDNA Sequence Alignment by Window based Optical Correlator
In genomics, pattern matching against a sequence of nucleotides plays a pivotal role for DNA sequence alignment and comparing genomes. This helps tackling some diseases, such as cancer in humans. The complexity of searching biological sequences in big databases has transformed sequence alignment problem into a challenging field of research in bioinformatics. A large number of research has been ...
متن کاملAlgorithms for Sequence Alignment
Sequence alignment is an important tool for describing relationships between sequences. Many sequence alignment algorithms exist, differing in efficiency, and in their models of the sequences and of the relationship between sequences. The focus of this thesis is on algorithms for the optimal alignment of two or three sequences of biological data, particularly DNA sequences. The algorithms are d...
متن کاملEfficient sequence alignment algorithms.
Sequence alignments are becoming more important with the increase of nucleic acid data. Fitch and Smith have recently given an example where multiple insertion/deletions (rather than a series of adjacent single insertion/deletions) are necessary to achieve the correct alignment. Multiple insertion/deletions are known to increase computation time from O(n2) to O(n3) although Gotoh has presented ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bioinformatics
سال: 2007
ISSN: 1367-4803,1460-2059
DOI: 10.1093/bioinformatics/btl297